491 research outputs found

    Iodoarene-Catalyzed Cyclizations of Unsaturated Amides

    Get PDF
    The cyclization of N-alkenylamides catalyzed by iodoarenes under oxidative conditions is presented. Five-, six-, and seven-membered rings with a range of substitutions can be prepared by this route. Preliminary data from the use of chiral iodoarenes as precatalysts show that enantiocontrol is feasible

    Development of suspension adapted Vero cell culture process technology for production of viral vaccines

    Get PDF
    Abstract Vero cells are considered as the most widely accepted continuous cell line by the regulatory authorities (such as WHO) for the manufacture of viral vaccines for human use. The growth of Vero cells is anchorage-dependent. Scale-up and manufacturing in adherent cultures are labor intensive and complicated. Adaptation of Vero cells to grow in suspension will simplify subcultivation and process scale-up significantly, and therefore reduce the production cost. Here we report on a successful adaptation of adherent Vero cells to grow in suspension in a serum-free and animal component-free medium (IHM03) developed in-house. The suspension adapted Vero cell cultures in IHM03 grew to similar or better maximum cell density as what was observed for the adherent Vero cells grown in commercial serum-free media and with a cell doubling time of 40–44 h. Much higher cell density (8 × 10 6 cells/mL) was achieved in a batch culture when three volume of the culture medium was replaced during the batch culture process. Both adherent and suspension Vero cells from various stages were tested for their authenticity using short tandem repeat analysis. Testing result indicates that all Vero cell samples had 100% concordance with the Vero DNA control sample, indicating the suspension cells maintained their genetic stability. Furthermore, suspension Vero cells at a passage number of 163 were assayed for tumorigenicity, and were not found to be tumorigenic. The viral productivity of suspension Vero cells was evaluated by using vesicular stomatitis virus (VSV) as a model. The suspension cell culture showed a better productivity of VSV than the adherent Vero cell culture. In addition, the suspension culture could be infected at higher cell densities, thus improving the volumetric virus productivity. More than one log of increase in the VSV productivity was achieved in a 3L bioreactor perfusion culture infected at a cell density of 6.8 × 10 6 cells/mL

    Byzantine Gathering in Networks

    Full text link
    This paper investigates an open problem introduced in [14]. Two or more mobile agents start from different nodes of a network and have to accomplish the task of gathering which consists in getting all together at the same node at the same time. An adversary chooses the initial nodes of the agents and assigns a different positive integer (called label) to each of them. Initially, each agent knows its label but does not know the labels of the other agents or their positions relative to its own. Agents move in synchronous rounds and can communicate with each other only when located at the same node. Up to f of the agents are Byzantine. A Byzantine agent can choose an arbitrary port when it moves, can convey arbitrary information to other agents and can change its label in every round, in particular by forging the label of another agent or by creating a completely new one. What is the minimum number M of good agents that guarantees deterministic gathering of all of them, with termination? We provide exact answers to this open problem by considering the case when the agents initially know the size of the network and the case when they do not. In the former case, we prove M=f+1 while in the latter, we prove M=f+2. More precisely, for networks of known size, we design a deterministic algorithm gathering all good agents in any network provided that the number of good agents is at least f+1. For networks of unknown size, we also design a deterministic algorithm ensuring the gathering of all good agents in any network but provided that the number of good agents is at least f+2. Both of our algorithms are optimal in terms of required number of good agents, as each of them perfectly matches the respective lower bound on M shown in [14], which is of f+1 when the size of the network is known and of f+2 when it is unknown

    Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks

    Get PDF
    We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal times for the other agent. The goal of the agents is to meet on an edge or a node of the graph. In this scenario, we study the time required by the agents to meet, compared to the meeting time TOPTT_{OPT} in the offline scenario in which the agents have complete knowledge about each others speed characteristics. When no additional assumptions are made, we show that rendezvous in our model can be achieved after time O(nTOPT)O(n T_{OPT}) in a nn-node graph, and that such time is essentially in some cases the best possible. However, we prove that the rendezvous time can be reduced to Θ(TOPT)\Theta (T_{OPT}) when the agents are allowed to exchange Θ(n)\Theta(n) bits of information at the start of the rendezvous process. We then show that under some natural assumption about the traversal times of edges, the hardness of the heterogeneous rendezvous problem can be substantially decreased, both in terms of time required for rendezvous without communication, and the communication complexity of achieving rendezvous in time Θ(TOPT)\Theta (T_{OPT})

    Anonymous Graph Exploration with Binoculars

    No full text
    International audienceWe investigate the exploration of networks by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the agent halts after the exploration except if the graph is a tree. We therefore endow the agent with binoculars, a sensing device that can show the local structure of the environment at a constant distance of the agent current location.We show that, with binoculars, it is possible to explore and halt in a large class of non-tree networks. We give a complete characterization of the class of networks that can be explored using binoculars using standard notions of discrete topology. This class is much larger than the class of trees: it contains in particular chordal graphs, plane triangulations and triangulations of the projective plane. Our characterization is constructive, we present an Exploration algorithm that is universal; this algorithm explores any network explorable with binoculars, and never halts in non-explorable networks

    A Search for Hierarchical Triples using Kepler Eclipse Timing

    Full text link
    We present the first results of a Kepler survey of 41 eclipsing binaries that we undertook to search for third star companions. Such tertiaries will periodically alter the eclipse timings through light travel time and dynamical effects. We discuss the prevalence of starspots and pulsation among these binaries and how these phenomena influence the eclipse times. There is no evidence of short period companions (P < 700 d) among this sample, but we do find evidence for long term timing variations in 14 targets (34%). We argue that this finding is consistent with the presence of tertiary companions among a significant fraction of the targets, especially if many have orbits measured in decades. This result supports the idea that the formation of close binaries involves the deposition of angular momentum into the orbital motion of a third star.Comment: AJ, in press, 104 pages, 2 figure sets plus 1 regular figur

    Performances de systèmes viticoles à faible niveau d’intrants phytopharmaceutiques dans le vignoble bordelais

    Get PDF
    Afin de répondre aux exigences de réduction de l'usage des produits phytosanitaires, ce projet vise à concevoir et à évaluer des systèmes viticoles qui en sont très économes. Ces systèmes, menés en agriculture conventionnelle ou biologique, sont basés essentiellement sur des leviers d'efficience de la lutte chimique pour la gestion des maladies et des ravageurs (règles de décision de traitement), et de substitution pour la maîtrise des adventices (travail du sol, couverts végétaux). Un autre type de système teste aussi le levier de la résistance variétale contre le mildiou et l'oïdium. Une évaluation multicritères de ces systèmes est effectuée pendant 5 ans au vignoble (réduction d’IFT, présence de résidus, maîtrise des bioagresseurs, atteinte des objectifs de rendement, coûts de production, temps de travail). Les résultats montrent que des systèmes basés essentiellement sur l'efficience permettent de réduire significativement l'IFT en maintenant des performances agronomiques et économiques satisfaisantes. Néanmoins, compte tenu d'une certaine prise de risque engendrée par ces systèmes, la diffusion des règles de décisions doit impliquer les viticulteurs. En viticulture biologique, il apparaît difficile de réduire les doses de cuivre et de soufre par rapport aux pratiques actuelles en maintenant des performances agronomiques stables. La mise en œuvre de variétés résistantes au mildiou et à l'oïdium permet de réduire l’IFT de 90 % par rapport aux références régionales

    Determination of fungal activity in modified wood by means of micro-calorimetry and determination of total esterase activity

    Get PDF
    Beech and pine wood blocks were treated with 1,3-dimethylol-4,5-dihydroxyethylen urea (DMDHEU) to increasing weight percent gains (WPG). The resistance of the treated specimens against Trametes versicolor and Coniophora puteana, determined as mass loss, increased with increasing WPG of DMDHEU. Metabolic activity of the fungi in the wood blocks was assessed as total esterase activity (TEA) based on the hydrolysis of fluorescein diacetate and as heat or energy production determined by isothermal micro-calorimetry. Both methods revealed that the fungal activity was related with the WPG and the mass loss caused by the fungi. Still, fungal activity was detected even in wood blocks of the highest WPG and showed that the treatment was not toxic to the fungi. Energy production showed a higher consistency with the mass loss after decay than TEA; higher mass loss was more stringently reflected by higher heat production rate. Heat production did not proceed linearly, possibly due to the inhibition of fungal activity by an excess of carbon dioxide
    corecore